Asymptotic Behavior of the Loss Probability for a Feedback Finite Fluid Queue with Downward Jumps
نویسندگان
چکیده
We consider a feedback finite fluid queue (FFFQ, for short) with downward jumps, where the fluid flow rate and the jump size are controlled by a background Markov chain with a finite state space. The ”feedback” means that the background process may change according to the level of the buffer, which is used for modeling TCP/IP flow. The matrix analytic technique has been successsfully applied to a FFFQ without jumps. We incorporate downward jumps into this FFFQ, and show that its loss probability decays exponentially as the buffer size gets large under a negative drift condition.
منابع مشابه
Asymptotic Behavior of Loss Rate for Feedback Finite Fluid Queue with Downward Jumps
We consider a feedback finite fluid queue with downward jumps, where the net flow rate and the jump size for the fluid are controlled by a background Markov chain with a finite state space. The finite means that the fluid queue has a finite buffer. The feedback means that the transition structure of the background process may change when the buffer content becomes empty or full. In this paper, ...
متن کاملAsymptotic Loss Probability in a Finite Buffer Fluid Queue with Heterogeneous
Consider a fluid queue with a finite buffer B and capacity c fed by a superposition of N independent On–Off processes. An On–Off process consists of a sequence of alternating independent periods of activity and silence. Successive periods of activity, as well as silence, are identically distributed. The process is active with probability p and during its activity period produces fluid at consta...
متن کاملAdvances in Applied Probability ON THE ASYMPTOTIC RELATIONSHIP BETWEEN THE OVERFLOW PROB- ABILITY AND THE LOSS RATIO
In this paper we study the asymptotic relationship between the loss ratio in a finite buffer system and the overflow probability (the tail of the queue length distribution) in the corresponding infinite buffer system. We model the system by a fluid queue which consists of a server with constant rate c and a fluid input. We provide asymptotic upper and lower bounds on the difference between log ...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کاملM1, M2, ..., Mk/G1, G2,..., Gk/l/N Queue with Buffer Division and Push-Out Schemes for ATM Networks (RESEARCH NOTE)
In this paper, loss probabilities and steady state probabilities of data packets for an asynchronous transfer mode (ATM) network are investigated under the buffer division and push-out schemes. Data packets are classified in classes k which arrive in Poisson fashion to the service facility and are served with general service rate under buffer division scheme, finite buffer space N is divided in...
متن کامل